A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem
نویسندگان
چکیده
We present a new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem. Its ratio is 43, which matches current best ratio. The of 65 on subcubic graphs, an improvement upon previous 54. novel extension primal-dual schema, consists two distinct phases. Both and analysis are much simpler than those approaches.
منابع مشابه
A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem
Consider the minimum k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, nd a k-edge-connected spanning subgraph of G with minimum number of edges. This problem is known to be NP-complete. Khuller and Raghavachari presented the rst algorithm with a performance ratio smaller than 2 for all k. They proved an upper bound of 1.85 for the performanc...
متن کاملToward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph Problem
Given a complete graph Kn = (V, E) with non-negative edge costs c ∈ R E , the problem 2EC is that of finding a 2-edge connected spanning multi-subgraph of Kn of minimum cost. The integrality gap α2EC of the linear programming relaxation 2EC LP for 2EC has been conjectured to be 6 5 , although currently we only know that 6 5 ≤ α2EC ≤ 3 2. In this paper, we explore the idea of using the structure...
متن کاملMinimum 2-Edge Connected Spanning Subgraph of Certain Interconnection Networks
Given an undirected graph, finding a minimum 2-edge connected spanning subgraph is NP-hard. We solve the problem for silicate network, brother cell and sierpiński gasket rhombus.
متن کاملA New Bound for the 2-Edge Connected Subgraph Problem
Given a complete undirected graph with non negative costs on the edges the Edge Connected Subgraph Problem consists in nding the minimum cost spanning edge connected subgraph where multi edges are allowed in the solution A lower bound for the minimum cost edge connected subgraph is obtained by solving the linear programming relaxation for this problem which coincides with the subtour relaxation...
متن کاملTowards New Bounds for the 2-Edge Connected Spanning Subgraph Problem
Given a complete graph Kn = (V,E) with non-negative edge costs c ∈ R , the problem multi-2ECcost is that of finding a 2-edge connected spanning multi-subgraph of Kn with minimum cost. It is believed that there are no efficient ways to solve the problem exactly, as it is NP-hard. Methods such as approximation algorithms, which rely on lower bounds like the linear programming relaxation multi-2EC...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2023
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2022.12.013